Direct Evolutionary Search for Nash Equilibria Detection
نویسندگان
چکیده
A Direct method of computing mixed form Nash equilibria of a normal form game by using a simple evolutionary algorithm is proposed. The Direct Evolutionary Search algorithm (DES) uses a generative relation for Nash equilibria with binary tournament selection and uniform mutation. Numerical experiments are used to illustrate the efficiency of the method.
منابع مشابه
Pareto-optimal Nash equilibrium detection using an evolutionary approach
Pareto-optimal Nash equilibrium is a refinement of the Nash equilibrium. An evolutionary method is described in order to detect this equilibrium. Generative relations induces a non-domination concept which is essentially in the detection method. Numerical experiments with games having multiple Nash equilibria are presented. The evolutionary method detects correctly the Pareto-optimal Nash equil...
متن کاملSimplified Mechanisms with Applications to Sponsored Search and Package Auctions
Simplified Mechanisms with Applications to Sponsored Search and Package Auctions Paul Milgrom First draft: August 16, 2007 This draft: October 13, 2007 A simplified mechanism is a direct mechanism modified by restricting the set of reports or bids. An example is the auction used to place ads on Internet search pages, in which each advertiser bids a single price to determine the allocation of ei...
متن کاملEquilibria Detection in Non-cooperative Game Theory. An Evolutionary Approach
The most important task in non-cooperative Game Theory is the equilibria detection. A computational method is presented in order to detect different types of equilibria. The method is based on generative relations. Generative relations are an algebraic tool for describing game equilibria. The generative relations of Nash, Aumann, Berge-Zhukovskii, Pareto and Lorenz equilibria are presented. The...
متن کاملEvolutionary stability and lexicographic preferences
We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. ...
متن کاملEvolutionary Stability of Pure-Strategy Equilibria in Finite Games
Sufficient conditions for pure-strategy Nash equilibria of finite games to be Ž . Lyapunov stable under a large class of evolutionary dynamics, the regular monotonic selection dynamics, are discussed. In particular, it is shown that in almost all finite extensive-form games, all the pure-strategy equilibria are stable. In such games, all mixed-strategy equilibria close to pure-strategy equilibr...
متن کامل